Combinatorial examples in universal coalgebra
نویسندگان
چکیده
منابع مشابه
Universal Dialgebra: Unifying Universal Algebra and Coalgebra
The concept of dialgebra provides a platform under which universal algebra and coalgebra are unified in one theory. Other examples of dialgebras include universal multialgebras and partial algebras. In the dialgebraic setting, several relationships between common features of these various theories are clarified and, in many cases, rather similar proofs of closely related results are combined to...
متن کاملUniversal coalgebra: a theory of systems
In the semantics of programming, nite data types such as nite lists, have traditionally been modelled by initial algebras. Later nal coalgebras were used in order to deal with in nite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certain types of automata and more generally, for (transition and dynamical) systems. An important property ...
متن کاملExamples of Combinatorial Duality
We will consider two easily stated combinatorial problems, determining if a given sequence of integers could arise as the numbers of wins in a round robin tournament and determining if a diagram of relations can be realized as ‘comes before’ for a set of intervals in time. Both problems will be given equivalent formulations of determining if a system of inequalities has a solution. These partic...
متن کاملSome Examples for Combinatorial Faces of Combinatorial Polytopes
DIRK OLIVER THEIS ABSTRACT. Let P be a d-dimensional polyhedron in Rd and S a non-empty proper face. The trivial fact that every linear inequality which is valid for P is also valid for P is can be understood as a projective mapping π : P → S from the polar of P to the polar of S. This mapping defines a subdivision of S by taking all intersections of images of faces of P. In this paper we inves...
متن کاملResearch on Universal Combinatorial Coding
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1983-0706504-6